Mapping Multiple Independent Synchronous Dataflow Graphs onto Heterogeneous Multiprocessors
نویسندگان
چکیده
We detail a method to facilitate development of realtime applications on heterogeneous multiprocessors. We introduce a new model of computation that allows for nondeterminate communication between independent dataflow graphs. The graphs may communicate in a manner that does not introduce data dependencies between them. We examine the implications of this model, introduce the necessary communication actors, and discuss scheduling techniques for multiple independent graphs. We also illustrate this model with some examples of real-time systems that have been constructed in Ptolemy.
منابع مشابه
Predictable mapping of streaming applications on multiprocessors
Predictable Mapping of Streaming Applications on Multiprocessors The design of new consumer electronics devices is getting more and more complex as more functionality is integrated into these devices. To manage the design complexity, a predictable design flow is needed. The result should be a system that guarantees that an application can perform its own tasks within strict timing deadlines, in...
متن کاملA Hierarchical Multiprocessor Scheduling Framework for Synchronous Dataflow Graphs
This paper discusses a hierarchical scheduling framework to reduce the complexity of scheduling synchronous dataflow (SDF) graphs onto multiple processors. The core of this framework is a clustering algorithm that reduces the number of nodes before expanding the SDF graph into a precedence DAG (directed acyclic graph). The internals of the clusters are then scheduled with uniprocessor SDF sched...
متن کاملHierarchical static scheduling of dataflow graphs onto multiple processors
In this paper we discuss a hierarchical scheduling framework to reduce the complexity of scheduling synchronous dataflow (SDF) graphs onto multiple processors. The core of this framework is a clustering technique that reduces the number of actors before expanding the SDF graph into an directed acyclic graph (DAG). The internals of the clusters are then scheduled with uniprocessor SDF schedulers...
متن کاملMapping Parameterized Cyclo-static Dataflow Graphs onto Configurable Hardware
In recent years, parameterized dataflow has evolved as a useful framework for modeling synchronous and cyclo-static graphs in which arbitrary parameters can be changed dynamically. Parameterized dataflow has proven to have significant expressive power for managing dynamics of DSP applications in important ways. However, efficient hardware synthesis techniques for parameterized datafow represent...
متن کاملExecuting synchronous data flow graphs on heterogeneous execution architectures using integer linear programming
This paper presents an integer linear programming (ILP) technique to partition and schedule Synchronous Data Flow (SDF) graphs onto heterogeneous execution architectures. Our ILP formulation gives a partition and schedule for SDF graphs, which provide the optimal execution time. We incorporate new methods of exploiting stateless data-parallelism on a heterogeneous architecture. We quantitativel...
متن کامل